Two-stage Bargaining Solutions
نویسندگان
چکیده
We introduce and characterize a new class of bargaining solutions: those which can be obtained by sequentially applying two binary relations to eliminate alternatives. As a by-product we obtain as a particular case a partial characterization result by Zhou (Econometrica, 1997) of an extension of the Nash axioms and solution to domains including non-convex problems, as well as a complete characterizations of solutions that satisfy Pareto optimality, Covariance with positive affine transformations, and Independence of irrelevant alternatives. J.E.L. codes: C72, D44.
منابع مشابه
Subgame-perfect implementation of bargaining solutions
February 1997 Final Version: October 15, 2001 This paper provides simple four-stage game forms that fully implement a large class of two-person bargaining solutions in subgame-perfect equilibrium. The solutions that can be implemented by our game forms are those that maximize a monotonic and quasi-concave function of utilities after normalizing each agent's utility function so that the maximum ...
متن کاملOrdinal Solutions to Bargaining Problems
A solution to bargaining problems is ordinal when it is covariant with order-preserving transformations of utility. Shapley (1969) has shown that there exists no ordinal, efficient, and symmetric solution to twoplayer bargaining problems, and has constructed such a solution to threeplayer problems. Here, Shapley’s solution is extended in two directions. First, it is shown how to construct an in...
متن کاملInterim Outcomes and Bargaining Solutions
In this paper, we employ a uni ed approach to Nashs two-person bargaining problem by using a class of axioms, which we term Common Disagreement Point (CDP) axioms. These axioms describe under what circumstances parties that expect to face sometimes uncertain nested or non-nested bargaining sets can reach interim outcomes. By doing so, these axioms portray a bargaining process, and thereby brid...
متن کاملRationality and solutions to nonconvex bargaining problems: Rationalizability and Nash solutions
Conditions α and β are two well-known rationality conditions in the theory of rational choice. This paper examines the implications of weaker versions of these two rationality conditions in the context of solutions to nonconvex bargaining problems. It is shown that, together with the standard axioms of efficiency and strict individual rationality, they imply rationalizability of solutions to no...
متن کاملRobustness of intermediate agreements and bargaining solutions
Most real-life bargaining resolves gradually; two parties reach intermediate agreements without knowing the whole range of possibilities. These intermediate agreements serve as disagreement points in subsequent rounds. Cooperative bargaining solutions ignore this dynamics and therefore can yield accurate predictions only if they are robust to its speci cation. We identify robustness criteria th...
متن کامل